// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            int-bounds\n\
       1            big-arr\n\
       2            big-arr-10x\n\
       3            empty\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
 int* bspDrawIndexes ; 
 int numBSPDrawIndexes ; 
 int numRedundantIndexes ; 

int FindDrawIndexes( int numIndexes, int *indexes ){
	int i, j, numTestIndexes;


	/* dummy check */
	if ( numIndexes < 3 || numBSPDrawIndexes < numIndexes || indexes == NULL ) {
		return numBSPDrawIndexes;
	}

	/* set limit */
	numTestIndexes = 1 + numBSPDrawIndexes - numIndexes;

	/* handle 3 indexes as a special case for performance */
	if ( numIndexes == 3 ) {
		/* run through all indexes */
		for ( i = 0; i < numTestIndexes; i++ )
		{
			/* test 3 indexes */
			if ( indexes[ 0 ] == bspDrawIndexes[ i ] &&
				 indexes[ 1 ] == bspDrawIndexes[ i + 1 ] &&
				 indexes[ 2 ] == bspDrawIndexes[ i + 2 ] ) {
				numRedundantIndexes += numIndexes;
				return i;
			}
		}

		/* failed */
		return numBSPDrawIndexes;
	}

	/* handle 4 or more indexes */
	for ( i = 0; i < numTestIndexes; i++ )
	{
		/* test first 4 indexes */
		if ( indexes[ 0 ] == bspDrawIndexes[ i ] &&
			 indexes[ 1 ] == bspDrawIndexes[ i + 1 ] &&
			 indexes[ 2 ] == bspDrawIndexes[ i + 2 ] &&
			 indexes[ 3 ] == bspDrawIndexes[ i + 3 ] ) {
			/* handle 4 indexes */
			if ( numIndexes == 4 ) {
				return i;
			}

			/* test the remainder */
			for ( j = 4; j < numIndexes; j++ )
			{
				if ( indexes[ j ] != bspDrawIndexes[ i + j ] ) {
					break;
				}
				else if ( j == ( numIndexes - 1 ) ) {
					numRedundantIndexes += numIndexes;
					return i;
				}
			}
		}
	}

	/* failed */
	return numBSPDrawIndexes;
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {

    // int-bounds
    case 0:
    {
          int numIndexes = 100;
        
          int _len_indexes0 = 1;
          int * indexes = (int *) malloc(_len_indexes0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_indexes0; _i0++) {
            indexes[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = FindDrawIndexes(numIndexes,indexes);
          printf("%d\n", benchRet); 
          free(indexes);
        
        break;
    }
    // big-arr
    case 1:
    {
          int numIndexes = 255;
        
          int _len_indexes0 = 65025;
          int * indexes = (int *) malloc(_len_indexes0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_indexes0; _i0++) {
            indexes[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = FindDrawIndexes(numIndexes,indexes);
          printf("%d\n", benchRet); 
          free(indexes);
        
        break;
    }
    // big-arr-10x
    case 2:
    {
          int numIndexes = 10;
        
          int _len_indexes0 = 100;
          int * indexes = (int *) malloc(_len_indexes0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_indexes0; _i0++) {
            indexes[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = FindDrawIndexes(numIndexes,indexes);
          printf("%d\n", benchRet); 
          free(indexes);
        
        break;
    }
    // empty
    case 3:
    {
          int numIndexes = ((-2 * (next_i()%2)) + 1) * next_i();
        
          int _len_indexes0 = 1;
          int * indexes = (int *) malloc(_len_indexes0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_indexes0; _i0++) {
            indexes[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = FindDrawIndexes(numIndexes,indexes);
          printf("%d\n", benchRet); 
          free(indexes);
        
        break;
    }
    default:
        usage();
        break;

    }

    return 0;
}
